Dickson Polynomials that are Involutions
نویسندگان
چکیده
Dickson polynomials which are permutations are interesting combinatorial objects and well studied. In this paper, we describe Dickson polynomials of the first kind in F2[x] that are involutions over finite fields of characteristic 2. Such description is obtained using modular arithmetic’s tools. We give results related to the cardinality and the number of fixed points (in the context of cryptographic application) of this corpus. We also present a class of Dickson involutions with high degree.
منابع مشابه
Ja n 20 04 Involutions Restricted by 3412 , Continued Fractions , and Chebyshev Polynomials
We study generating functions for the number of involutions, even involutions, and odd involutions in Sn subject to two restrictions. One restriction is that the involution avoid 3412 or contain 3412 exactly once. The other restriction is that the involution avoid another pattern τ or contain τ exactly once. In many cases we express these generating functions in terms of Chebyshev polynomials o...
متن کاملRestricted 132 - Involutions
We study generating functions for the number of involutions of length n avoiding (or containing exactly once) 132 and avoiding (or containing exactly once) an arbitrary permutation τ of length k. In several interesting cases these generating functions depend only on k and can be expressed via Chebyshev polynomials of the second kind. In particular, we show that involutions of length n avoiding ...
متن کاملA class of permutation polynomials of F2m related to Dickson polynomials
We construct a class of permutation polynomials of F2m that are closely related to Dickson polynomials.
متن کاملBivariate Factorizations Connecting Dickson Polynomials and Galois Theory
In his Ph.D. Thesis of 1897, Dickson introduced certain permutation polynomials whose Galois groups are essentially the dihedral groups. These are now called Dickson polynomials of the first kind, to distinguish them from their variations introduced by Schur in 1923, which are now called Dickson polynomials of the second kind. In the last few decades there have been extensive investigations of ...
متن کاملReversed Dickson polynomials over finite fields
Reversed Dickson polynomials over finite fields are obtained from Dickson polynomials Dn(x, a) over finite fields by reversing the roles of the indeterminate x and the parameter a. We study reversed Dickson polynomials with emphasis on their permutational properties over finite fields. We show that reversed Dickson permutation polynomials (RDPPs) are closely related to almost perfect nonlinear ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2015 شماره
صفحات -
تاریخ انتشار 2015